POPPONENT: Highly accurate, individually and socially efficient opponent preference model in bilateral multi issue negotiations (Extended Abstract)
نویسندگان
چکیده
In automated bilateral multi issue negotiations, two intelligent automated agents negotiate on behalf of their owners over many issues in order to reach an agreement. Modeling the opponent can excessively boost the performance of the agents and increase the quality of the negotiation outcome. State of the art models accomplish this by considering some assumptions about the opponent which restricts their applicability in real scenarios. In this paper, a less restricted technique (POPPONENT) is proposed, where perceptron units are applied in modelling the preferences of the opponent. This model adopts a Multi Bipartite version of the Standard Gradient Descent search algorithm (MBGD) to find the best hypothesis, which is the best preference profile. In order to evaluate the accuracy and performance of this proposed opponent model, it is compared with the state of the art models available in the Genius repository and in the devised setting. The results approve the higher accuracy of POPPONENT compared to the most accurate state of the art model. Evaluating the model in the real world negotiation scenarios in the Genius framework also confirms its high accuracy in relation to the state of the art models in estimating the utility of offers. The findings here indicate that the proposed model is individually and socially efficient. The proposed MBGD method could also be adopted in similar practical areas of Artificial Intelligence.
منابع مشابه
Opponent modelling in automated multi-issue negotiation using Bayesian learning
The efficiency of automated multi-issue negotiation depends on the availability and quality of knowledge about an opponent. We present a generic framework based on Bayesian learning to learn an opponent model, i.e. the issue preferences as well as the issue priorities of an opponent. The algorithm proposed is able to effectively learn opponent preferences from bid exchanges by making some assum...
متن کاملUsing Opponent Models for Efficient Negotiation ( Extended
Information about the opponent is essential to improve automated negotiation strategies for bilateral multi-issue negotiation. In this paper we propose a negotiation strategy that combines a Bayesian technique to learn the preferences of an opponent during bidding and a Tit-for-Tat-like strategy to avoid exploitation by the opponent. The learned opponent model is used to achieve two important g...
متن کاملA Survey of Opponent Modeling Techniques in Automated Negotiation (JAAMAS Extended Abstract)
Negotiation is a process in which parties interact to settle a mutual concern to improve their status quo. Traditionally, negotiation is a necessary, but time-consuming and expensive activity. Therefore, in the last two decades, there has been a growing interest in the automation of negotiation. One of the key challenges for a successful negotiation is that usually only limited information is a...
متن کاملA Behavioral Study of Concession-making: Multi-attribute Auctions vs. Multi-bilateral Negotiations
Concession-making behavior is an essential process in negotiations and auctions and has a critical impact on the outcomes of an exchange. In auctions, concessions relate to deciding on the next bid by bid-makers, while in negotiations they involve proposing next offers by both parties. The purpose of this paper is to empirically investigate concession-making by parties in multi-attribute auctio...
متن کاملPrediction of the Opponent's Preference in Bilateral Multi-issue Negotiation Through Bayesian Learning
In multi-issue negotiation, agents’ preferences are extremely important factors for reaching mutual beneficial agreements. However, agents would usually keeping their preferences in secret in order to avoid be exploited by their opponents during a negotiation. Thus, preference modelling has become an important research direction in the area of agent-based negotiation. In this paper, a bilateral...
متن کامل